Nuprl Lemma : p-co-filter_wf
11,40
postcript
pdf
T
:Type,
P
:(
T
),
f
:(
x
:
T
. Dec(
P
(
x
))). p-co-filter(
f
)
T
(
T
+ Top)
latex
ProofTree
Definitions
Void
,
t
T
,
x
:
A
.
B
(
x
)
,
Top
,
inl
x
,
x
:
A
B
(
x
)
,
x
:
A
.
B
(
x
)
,
x
(
s
)
,
inr
x
,
f
(
a
)
,
A
,
Type
,
,
left
+
right
,
P
Q
,
case
b
of inl(
x
) =>
s
(
x
) | inr(
y
) =>
t
(
y
)
,
x
.
A
(
x
)
,
p-co-filter(
f
)
,
Dec(
P
)
Lemmas
not
wf
,
top
wf
origin
T:Type, P:(T
), f:(x:T. Dec(P(x))). p-co-filter(f) 
T(T + Top)
T:Type, P:(T), f:(x:T. Dec(P(x))). p-co-filter(f) T(T + Top)
T
x:A.B(x)B(x)x:A. B(x)
A
Q
x.A(x)